1)-labeling相关论文
An L(2,1)-labeling of a graph G is an assignment of nonnegative integers to the vertices of G such that adjacent vertice......
An L(3,2,1)-labeling of a graph G is a function f from the vertex set V(G) to the set of all non-negative integers (labe......
本文通过对荣华二采区10...
An L(2, 1)-labeling of a graph G is a function f from the vertex set V(G)to the set of all nonnegative integers such tha......
研究了距离图G(Z, D)的L(2, 1)-标号着色数λ(G(Z, D)). 对一般的有限距离集D, 证明了2|D|+2≤λ(G(Z, D))≤|D|2+3|D|. 此外, 当D......
图G的L(2,1)-标号是一个从顶点集V(G)到非负整数集的函数f(x),使得若d(x,y)=1,则|f(x)-f(y)|≥2;若d(x,y)=2,则|f(x)-f(y)|≥1.图G......
给出几种特殊图的L(0,1)-标号数,L(0,1)-边跨距的定义以及几类特殊图的L(0,1)-边跨距的具体值....
摘 要:为了更好地研究频道分配问题,引入了从顶点集到非负整数集的一个函数,即图的一个L(2,1)—标号。假设最小标号为零,图的L(2,1)—标号数......
研究了距离图G(Z, D)的L(2, 1)-标号着色数λ(G(Z, D)). 对一般的有限距离集D, 证明了2|D|+2≤λ(G(Z, D))≤|D|2+3|D|. 此外, 当D......
对于给定图G顶点集上一个非负整数函数f,满足:若dG(u,v)=1,f(u)-f(v)≥d;若 dG(u,v)=2,f(u)-f(v)≥1.称f 为L(2,1)-标号.这是由频道......
A k-L(2,1)-labeling for a graph G is a function such that whenever and whenever u and v are at distance two apart. The ......
图G的L(2,1)标号是一个从顶点集Ⅴ(G)到非负整数集的函数f(x),使得若d(x,y)=1,则|f(x)-f(y)|≥2;若d(x,y)=2,则|f(x)-f(y)|≥1.移......